Mixing and hitting times for finite Markov chains
نویسنده
چکیده
Let 0 < α < 1/2. We show that that the mixing time of a continuous-time Markov chain on a finite state space is about as large as the largest expected hitting time of a subset of the state space with stationary measure ≥ α. Suitably modified results hold in discrete time and/or without the reversibility assumption. The key technical tool in the proof is the construction of random set A such that the hitting time of A is a light-tailed stationary time for the chain. We note that essentially the same results were obtained independently by Peres and Sousi.
منابع مشابه
Mixing times are hitting times of large sets
We consider irreducible reversible discrete time Markov chains on a finite state space. Mixing times and hitting times are fundamental parameters of the chain. We relate them by showing that the mixing time of the lazy chain is equivalent to the maximum over initial states x and large sets A of the hitting time of A starting from x. We also prove that the first time when averaging over two cons...
متن کاملCharacterization of cutoff for reversible Markov chains
A sequence of Markov chains is said to exhibit cutoff if the convergence to stationarity in total variation distance is abrupt. We prove a necessary and sufficient condition for cutoff in reversible lazy chains in terms of concentration of hitting time of certain sets of large stationary measure. (Previous works of Aldous, Oliviera, Sousi and the speaker established a less precise connection be...
متن کاملMixing Times and Moving Targets
We consider irreducible Markov chains on a finite state space. We show that the mixing time of any such chain is equivalent to the maximum, over initial states x and moving large sets (As)s, of the hitting time of (As)s starting from x. We prove that in the case of the d-dimensional torus the maximum hitting time of moving targets is equal to the maximum hitting time of stationary targets. Neve...
متن کاملHitting times and Interlacing Eigenvalues: a Stochastic Approach Using Intertwinings
We develop a systematic matrix-analytic approach, based on intertwinings of Markov semigroups, for proving theorems about hitting-time distributions for finite-state Markov chains—an approach that (sometimes) deepens understanding of the theorems by providing corresponding sample-path-by-sample-path stochastic constructions. We employ our approach to give new proofs and constructions for two th...
متن کاملTight Inequalities among Set Hitting times in Markov Chains
Given an irreducible discrete-time Markov chain on a finite state space, we consider the largest expected hitting time T (α) of a set of stationary measure at least α for α ∈ (0, 1). We obtain tight inequalities among the values of T (α) for different choices of α. One consequence is that T (α) ≤ T (1/2)/α for all α < 1/2. As a corollary we have that, if the chain is lazy in a certain sense as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011